package Week6.J0524;

import java.util.Scanner;

public class 计算字符串的编辑距离_xv { // Levenshtein
    static int[][] dp;
    static char[] a, b;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        a = scanner.next().toCharArray();
        b = scanner.next().toCharArray();
        int n = a.length, m = b.length;
        dp = new int[n + 1][m + 1];

        for (int i = 0; i <= n; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= m; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (a[i - 1] == b[j - 1]) dp[i][j] = dp[i - 1][j - 1];
                else {
                    dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
                }
            }
        }

        System.out.println(dp[n][m]);
    }
}
